System-level Co-simulation of Integrated Avionics Using Polychrony

International audienceThe design of embedded systems from multiple views and heterogeneous models is ubiquitous in avionics as, in partic- ular, different high-level modeling standards are adopted for specifying the structure, hardware and software components of a system. The system-level simulation of such composite models is necessary but difficult task, allowing to validate global design choices as early as possible in the system de- sign flow. This paper presents an approach to the issue of composing, integrating and simulating heterogeneous mod- els in a system co-design flow. First, the functional behavior of an application is modeled with synchronous data-flow and statechart diagrams using Simulink/Gene-Auto. The system architecture is modeled in the AADL standard. These high- level, synchronous and asynchronous, models are then trans- lated into a common model, based on a polychronous model of computation, allowing for a Globally Asynchronous Lo- cally Synchronous (GALS) interpretation of the composed models. This translation is implemented as an automatic model transformation within Polychrony, a toolkit for em- bedded systems design. Simulation, including profiling and value change dump demonstration, has been carried out based on the common model within Polychrony. An avionic case study, consisting of a simplified doors and slides control system, is presented to illustrate our approach

Une méthodologie de spécification et de validation de systèmes hétérogènes fondée sur un modèle de contrats pour la conception des systèmes embarqués

Contract-based design is an expressive paradigm for a modular and compositional specification of programs. It is in turn becoming a fundamental concept in mainstream industrial computer-aided design tools for embedded system design. In this thesis, we elaborate new foundations for contract-based embedded system design by proposing a general-purpose algebra of assume/guarantee contracts based on two simple concepts: first, the assumption or guarantee of a component is defined as a filter and, second, filters enjoy the structure of a Boolean algebra. This yields a structure of contracts that is a Heyting algebra. In this framework, contracts are used to negotiate the correctness of assumptions made on the definition of a component at the point where it is used and provides guarantees to its environment. We put this algebra to work for the definition of a general purpose module system whose typing paradigm is based on the notion of contract. The type of a module is a contract holding assumptions made and guarantees offered by its behaviors. We illustrate this presentation with the specification of a simplified 4-stroke engine model.Les contrats basés sur les notions d'hypothèses/garanties constituent un paradigme expressif pour une conception modulaire et compositionnelle de spécification de programmes. Ils sont devenus un concept fondamental dans les procédés employés par les outils de conception assistée par ordinateur, pour la conception de systèmes informatiques. Dans cette thèse, nous élaborons des fondements pour la mise en oeuvre de systèmes embarqués basée sur la notion de contrats. Nous proposons ainsi une algèbre de contrats basée sur deux concepts simples : les hypothèses et les garanties des composants sont définies par des filtres, les filtres sont caractérisés par une structure d'algèbre booléenne. Les choix effectués pour définir la structure des filtres permettent de définir une algèbre de Heyting sur l'ensemble des contrats. Un cadre de travail est ainsi défini, dans lequel les contrats sont utilisés pour vérifier la correction des hypothèses faites sur le contexte d'utilisation d'un composant, et pour fournir à l'environnement les garanties qui lui sont demandées. Nous utilisons cette algèbre pour définir un système de modules dont le paradigme de typage est basé sur la notion de contrats. Le type d'un module est un contrat caractérisé par les hypothèses faites par l'environnement et les garanties offertes par les comportements du module. Nous illustrons cette présentation avec la spécification d'un moteur à quatre temps

Une méthodologie de spécification et de validation de systèmes hétérogènes fondée sur un modèle de contrats pour la conception des systèmes embarqués

Contract-based design is an expressive paradigm for a modular and compositional specification of programs. It is in turn becoming a fundamental concept in mainstream industrial computer-aided design tools for embedded system design. In this thesis, we elaborate new foundations for contract-based embedded system design by proposing a general-purpose algebra of assume/guarantee contracts based on two simple concepts: first, the assumption or guarantee of a component is defined as a filter and, second, filters enjoy the structure of a Boolean algebra. This yields a structure of contracts that is a Heyting algebra. In this framework, contracts are used to negotiate the correctness of assumptions made on the definition of a component at the point where it is used and provides guarantees to its environment. We put this algebra to work for the definition of a general purpose module system whose typing paradigm is based on the notion of contract. The type of a module is a contract holding assumptions made and guarantees offered by its behaviors. We illustrate this presentation with the specification of a simplified 4-stroke engine model.Les contrats basés sur les notions d'hypothèses/garanties constituent un paradigme expressif pour une conception modulaire et compositionnelle de spécification de programmes. Ils sont devenus un concept fondamental dans les procédés employés par les outils de conception assistée par ordinateur, pour la conception de systèmes informatiques. Dans cette thèse, nous élaborons des fondements pour la mise en oeuvre de systèmes embarqués basée sur la notion de contrats. Nous proposons ainsi une algèbre de contrats basée sur deux concepts simples : les hypothèses et les garanties des composants sont définies par des filtres, les filtres sont caractérisés par une structure d'algèbre booléenne. Les choix effectués pour définir la structure des filtres permettent de définir une algèbre de Heyting sur l'ensemble des contrats. Un cadre de travail est ainsi défini, dans lequel les contrats sont utilisés pour vérifier la correction des hypothèses faites sur le contexte d'utilisation d'un composant, et pour fournir à l'environnement les garanties qui lui sont demandées. Nous utilisons cette algèbre pour définir un système de modules dont le paradigme de typage est basé sur la notion de contrats. Le type d'un module est un contrat caractérisé par les hypothèses faites par l'environnement et les garanties offertes par les comportements du module. Nous illustrons cette présentation avec la spécification d'un moteur à quatre temps

An autonomous tracability mechanism for a group of RFID tags

International audienceCoupled Objects are an innovative way to ensure integrity of group of objects, or complex objects made of parts. This principle can be used in various applications such as logistic or security. The main property of coupled objects is that integrity checking is autonomous and does not depend on external information systems: all the necessary data are self contained in radio-frequency identification tags associated to the objects. This avoids important issues such as scalability and privacy, but the self-contained approach makes error diagnostics difficult when an integrity check fails. In this paper, we propose a solution to this problem, with a resilient data structure supporting the identification of missing elements in a coupled object. When some elements among the coupled objects are missing, it is possible to detect if the group is corrupted. Moreover, our approach also allows to identify the missing elements

A Smart Waste Management with Self-Describing objects

International audienceRadio Frequency Identification (RFID) is a pervasive computing technology that can be used to improve waste management by providing early automatic identification of waste at bin level. In this paper, we propose a smart bin application based on information self-contained in tags associated to each waste item. The wastes are tracked by smart bins using a RFID-based system without requiring the support of an external information system. Two crucial features of the selective sorting process can be improved using this approach. First, the user is helped in the application of selective sorting. Second, the smart bin knows its content and can report back to the rest of the recycling chain

A robust RFID inventory

International audienceReading a set of RFID tags all at once is an important feature of the RFID technology for many applications. However, RFID inventory is not completely reliable as tags may be missed in unfavorable situations. In this paper, we propose an application level protocol based on an integrity checking mechanism supporting a reliable inventory process. The integrity information is self-contained in tag group and the protocol does not require any support from an external information system, enabling autonomous and standalone operation

Une méthodologie de spécification et de validation de systèmes hétérogènes fondée sur un modèle de contrats pour la conception de systèmes embarqués

Les contrats basés sur les notions d'hypothèses/garanties constituent un paradigme expressif pour une conception modulaire et compositionnelle de spécification de programmes. Dans cette thèse, nous élaborons des fondements pour la mise en oeuvre de systèmes embarqués basée sur la notion de contrats. Nous proposons ainsi une alge bre de contrats basée sur deux concepts simples : les hypothèses et les garanties des composants sont définies par des filtres, les filtres sont caractérisés par une structure d'algèbre booléenne. Les choix effectués pour définir la structure des filtres permettent de définir une algèbre de Heyting sur l'ensemble des contrats. Un cadre de travail est ainsi défini, dans lequel les contrats sont utilisés pour vérifier la correction des hypothèses faites sur le contexte d'utilisation d'un composant, et pour fournir à l'environnement les garanties qui lui sont demandées. Nous illustrons cette présentation avec la spécification d'un moteur à quatre temps.Contract-based design is an expressive paradigm for a modular and compositional specification of programs. In this thesis, we elaborate new foundations for contract-based embedded system design by proposing a general-purpose algebra of assume/guarantee contracts based on two simple concepts: first, the assumption or guarantee of a component is defined as a filter and, second, filters enjoy the structure of a Boolean algebra. This yields a structure of contracts that is a Heyting algebra. In this framework, contracts are used to negotiate the correctness of assumptions made on the definition of a component at the point where it is used and provides guarantees to its environment. We put this algebra to work for the definition of a general purpose module system whose typing paradigm is based on the notion of contract.We illustrate this presentation with the specification of a simplified 4-stroke engine model.RENNES1-BU Sciences Philo (352382102) / SudocRENNES-INRIA Rennes Irisa (352382340) / SudocSudocFranceF

A Smart Waste Management with Self-Describing Complex Objects

Invited journalInternational audienceRadio Frequency Identification (RFID) is a perva-sive computing technology that can be used to improve wastemanagement by providing early automatic identification of wasteat bin level. In this paper, we have presented a smart binapplication based on information self-contained in tags associatedto each waste item. The wastes are tracked by smart bins using aRFID-based system without requiring the support of an externalinformation system. Two crucial features of the selective sortingprocess can be improved by using this approach. First, the useris helped in the application of selective sorting. Second, the smartbin knows its content up to the precision of composed materialsby types and percentage. It can report back with its status orabnormalities to the rest of the recycling chain. Complex objectslike e-waste, hazardous ones, etc. can also be sorted and detectedfor hazards with the self-describing approach

Using Animation to Improve Formal Specifications of Security Protocols, in "Joint conference SAR-SSI

The verification of cryptographic protocols has greatly improved these last years. Automated tools such as AVISPA provide real help in finding and characterizing attacks. The counterpart is the formal specification of the protocol, using an appropriate language such as HLPSL. Since HLPSL is a very expressive language, this stage is complicated and error-prone before a correct specification is eventually obtained. The verification tools of AVISPA are not designed to detect such specification errors. Unfortunately, as long as it contains typo-like errors, the verification of a HLPSL specification is pointless. In this paper, we propose an animation tool called SPAN †. It turns a formal protocol specification into an execution diagram, according to user choices. We show how the visualization eases the formal specification stage in many ways: drawing of typical execution diagrams, visualization of protocol termination, understanding of interleaved sessions, detection of unwanted side effects, etc. We also show how visualization and simulation of an intruder helps in finding attacks that are not automatically detected by tools

Distributed Tree Structure for Composite Physical Objects

International audienceDistributed computing has become very common and finds better fit in many real life applications over centralized approaches. However, providing self-organization, self-repair, resilience features remain challenging task for such approach. We have presented a hierarchical model where its structural information could be distributed and stored into the leaf nodes. We have envisaged the leaves of the tree as real physical entities and the remaining nodes as virtual ones to build a hierarchical structure. Henceforth, the tree could be built using these leaf nodes and its robustness can track for the missing leaves